Constraining rule-based dynamics with types
نویسندگان
چکیده
منابع مشابه
Constraining rule-based dynamics with types
A generalized framework of site graphs is introduced in order to provide the first fully semantic definition of the side-effect-free core of the rule-based language Kappa. This formalization allows for the use of types either to confirm that a rule respects a certain invariant or to guide a restricted refinement process that allows us to constrain its run-time applicability.
متن کاملWeakly Constraining Multimedia Types Based on a Type Embedding Ordering
cover author keywords set_of image string string year name integer book [4_tuple_of] text 2_tuple_of set_of image string string integer book [4_tuple_of] text 2_tuple_of name a) tree form of a type: b) a more abstract tree form: Fig. 1. Di erent kinds of type presentation forms. Part a) depicts a type in tree form. Attribute names appear as labels on the edges. Part b) is derived from part a) b...
متن کاملConstraining Modified Newtonian Dynamics with Gravitational Waves
In the weak-field limit of General Relativity, gravitational waves obey linear equations and propagate at the speed of light. These properties of General Relativity are supported by the observation of ultra high energy cosmic rays as well as by LIGO’s recent detection of gravitation waves. We argue that two existing relativistic generalizations of Modified Newtonian Dynamics, namely Generalized...
متن کاملA Margin-based Model with a Fast Local Searchnewline for Rule Weighting and Reduction in Fuzzynewline Rule-based Classification Systems
Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...
متن کاملConstraining Analogical Inference with Memory-based Verification
From, Analogies complete their primary task of generating new knowledge about a problem domain, based on a noted similarity between the problem and some other familiar domain. Analogical inferences are generated as a form of pattern completion occurring in the target domain, but not all comparisons between structurally similar domains generate valid inferences. We highlight the need for a domai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2013
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129512000114